Mining Negative Rules Using GRD

نویسندگان

  • Dhananjay R. Thiruvady
  • Geoffrey I. Webb
چکیده

GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user must specify a measure of interestingness and the number of rules sought (k). This paper reports efficient techniques to extend GRD to support mining of negative rules.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Positive Negative Association Rule Mining Using Improved Frequent Pattern Tree

Association Rule is an important tool for today data mining technique. But this work only concern with positive rule generation till now. This paper gives study for generating negative and positive rule generation as demand of modern data mining techniques requirements. Here also gives detail of “A method for generating all positive and negative Association Rules” (PNAR). PNAR help to generates...

متن کامل

A Negative Association Rules for Web Usage Mining Using Negative Selection Algorithm

The immense capacity of web usage data which survives on web servers contains potentially precious information about the performance of website visitors. Pattern Mining involves applying data mining methods to large web data repositories to extract usage patterns. Due to the emerging reputation of the World Wide Web, many websites classically experience thousands of visitors every day. Examinat...

متن کامل

Effective Positive Negative Association Rule Mining Using Improved Frequent Pattern

Association Rule is an important tool for today data mining technique. But this work only concern with positive rule generation till now. This paper gives study for generating negative and positive rule generation as demand of modern data mining techniques requirements. Here also gives detail of “A method for generating all positive and negative Association Rules” (PNAR). PNAR help to generates...

متن کامل

FS-XCS vs. GRD-XCS: An analysis using high-dimensional DNA microarray gene expression data sets

XCS, a Genetic Based Machine Learning model that combines reinforcement learning with evolutionary algorithms to evolve a population of classifiers in the form of condition-action rules, has been used successfully for many classification tasks. However, like many other machine learning algorithms, XCS becomes less effective when it is applied to high-dimensional data sets. In this paper, we pre...

متن کامل

Mining & Optimization of Association Rules Using Effective Algorithm

Association Rule Mining is generally performed in Generation of frequent item sets & Rule generation. Mining association rules is not full of reward until it can be utilized to improve decision-making process of an organization. This paper is concerned with discovering positive and negative association rules. We present an Apriori-based algorithm that is able to find all valid positive and nega...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004